Rome-Moscow school of Matrix Methods and Applied Linear Algebra
نویسنده
چکیده
Rome, Sept 19 Oct 3, 2010, Moscow, Oct 10 Oct 24, 2010 Carmine Di Fiore In questi appunti si introducono e si studiano le matrici circolanti, τ e Toeplitz, le algebre di Hessenberg e le decomposizioni di dislocamento, gli spazi di classe V e le migliori approssimazioni nel senso dei minimi quadrati in tali spazi. Come conseguenza dei risultati presentati, la scelta delle matrici coinvolte nelle decomposizioni di dislocamento, la scelta dei precondizionatori nella risoluzione di sistemi lineari e la scelta delle approssimazioni dell’Hessiano nei metodi di minimizzazione quasi-Newton, diventa possibile in classi più ampie di algebre di matrici di bassa complessità. La matrice di Fourier, le matrici circolanti, e le trasformate discrete veloci Si consideri la seguente matrice n × n P1 =
منابع مشابه
Some results on Haar wavelets matrix through linear algebra
Can we characterize the wavelets through linear transformation? the answer for this question is certainly YES. In this paper we have characterized the Haar wavelet matrix by their linear transformation and proved some theorems on properties of Haar wavelet matrix such as Trace, eigenvalue and eigenvector and diagonalization of a matrix.
متن کاملSingular value inequalities for positive semidefinite matrices
In this note, we obtain some singular values inequalities for positive semidefinite matrices by using block matrix technique. Our results are similar to some inequalities shown by Bhatia and Kittaneh in [Linear Algebra Appl. 308 (2000) 203-211] and [Linear Algebra Appl. 428 (2008) 2177-2191].
متن کاملA Class of Nested Iteration Schemes for Generalized Coupled Sylvester Matrix Equation
Global Krylov subspace methods are the most efficient and robust methods to solve generalized coupled Sylvester matrix equation. In this paper, we propose the nested splitting conjugate gradient process for solving this equation. This method has inner and outer iterations, which employs the generalized conjugate gradient method as an inner iteration to approximate each outer iterate, while each...
متن کاملFace Recognition Based Rank Reduction SVD Approach
Standard face recognition algorithms that use standard feature extraction techniques always suffer from image performance degradation. Recently, singular value decomposition and low-rank matrix are applied in many applications,including pattern recognition and feature extraction. The main objective of this research is to design an efficient face recognition approach by combining many tech...
متن کاملPreconditioned Generalized Minimal Residual Method for Solving Fractional Advection-Diffusion Equation
Introduction Fractional differential equations (FDEs) have attracted much attention and have been widely used in the fields of finance, physics, image processing, and biology, etc. It is not always possible to find an analytical solution for such equations. The approximate solution or numerical scheme may be a good approach, particularly, the schemes in numerical linear algebra for solving ...
متن کامل